Abstract: Dynamic task allocation is a key issue of open multiagent system(MAS). Based on the algorithm given by the reference ［9］, this paper presents an improved algorithm for a new task appearing at any time in the process of task allocation or executing. The paper takes into account the Agent’s expectation of the known tasks and future tasks, in order to guide the agent reasonable bid to get the optimum alloction. With multiagent transporting army supplies for background, the results show that the algorithm is reasonable and effective.

Key words: dynamic task allocation, expectation, auction